Relay selection based clustering techniques for high density LTE networks

Relay Selection for Af Based Cooperative Networks

In this paper, a performance analysis of amplifyand-forward (AF) relaying cooperative diversity system with relay selection is given when all terminals are moving. We have derived analytical expressions for probability density function (PDF), cumulative distribution function (CDF) and moment generating function (MGF) of end-to-end signal-to-noise ratio (SNR) for the considered system. Then, the...

Relay Selection and Resource Allocation in LTE-Advanced Cognitive Relay Networks

In this work, we consider the problem of joint relay selection and resource allocation in Long Term Evolution-Advanced (LTE-A) systems which provides both cognitive radio and relaying scheme capabilities. We assume that the total network is deployed in an overlay scheme where the primary user communicates via a relay assisted LTE-A network, some of the secondary users play the relaying role and...

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

Base station antenna selection for LTE networks

Clustering for High Dimensional Data: Density based Subspace Clustering Algorithms

Finding clusters in high dimensional data is a challenging task as the high dimensional data comprises hundreds of attributes. Subspace clustering is an evolving methodology which, instead of finding clusters in the entire feature space, it aims at finding clusters in various overlapping or non-overlapping subspaces of the high dimensional dataset. Density based subspace clustering algorithms t...